PARTS - Privacy-Aware Routing with Transportation Subgraphs

نویسندگان

  • Christian Roth
  • Lukas Hartmann
  • Dogan Kesdogan
چکیده

To ensure privacy for route planning applications and other location based services (LBS), the service provider must be prevented from tracking a user’s path during navigation on the application level. However, the navigation functionality must be preserved. We introduce the algorithm PARTS to split route requests into route parts which will be submitted to an LBS in an unlinkable way. Equipped with the usage of dummy requests and time shifting, our approach can achieve better privacy. We will show that our algorithm protects privacy in the presence of a realistic adversary model while maintaining the service quality. 1

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...

متن کامل

An Efficient Security Aware Routing Protocol for Mobile Ad Hoc Networks

Mobile Ad-Hoc Networks (MANETs) uses security routing scheme for establishing secure route and securely data transmission. The security issues in MANET are mostly concentrated in two parts. The main security threat in MANET is integrity, non-repudiation and privacy. To combat with these security threats, many secure routing protocols has been designed to reduce the security threats in MANET. In...

متن کامل

Supply Chain Scheduling Using a Transportation System Composed of Vehicle Routing Problem and Cross-Docking Approaches

This study considers a combination of cross-docking and vehicle routing problem (VRP) approachesto transport raw material and parts in a supply chain. The supply chain is composed of some supplierswhich are spread in different geographical zones and multiple shared vehicles with different speedsand capacities for transporting orders from the suppliers to a manufacturer. After ...

متن کامل

Developing a Bi-level Objective Model of Risk-Cost Trade-off for Solving Locating-Routing Problem in Transportation of Hazardous Material

Allocating and routing problems in the field of transportation engineering are generally solved using the objective function of minimizing transport cost. Transport risk is a main concern in hazardous material transportation, mainly dependent on the vision of decision makers (national and/or local authorities). In this research work, a trade-off approach has been proposed to determine the safes...

متن کامل

k - RDF-Neighbourhood Anonymity: Combining Structural and Attribute-based Anonymisation for Linked Data

We provide a new way for anonymising a heterogeneous graph containing personal identifiable information. The anonymisation algorithm is called k− RDF-neighbourhood anonymity, because it changes the one hoop neighbourhood of at least k persons inside an RDF graph so that they cannot be distinguished. This enhances the privacy of persons represented in the graph. Our approach allows us to control...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017